منابع مشابه
dynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولTowards the optimal synchronization granularity for dynamic scheduling of pipelined computations on heterogeneous computing systems
1School of Electrical and Computer Engineering, National Technical University of Athens, 9, Heroon Polytechnioy, Zografou, 15773, Athens, Greece 2Center for Information Services and High Performance Computing, Technische Universität Dresden, Zellescher Weg 12/14, Dresden, 01062, Germany 3Department of Informatics, Ionian University, 7, Tsirigoti Square, 49100 Corfu, Greece 4Department of Comput...
متن کامل4D PET: Beyond conventional dynamic PET imaging
In this paper, we review novel techniques in the emerging field of spatiotemporal 4D PET imaging. We will discuss existing limitations in conventional dynamic PET imaging which involves independent reconstruction of dynamic PET datasets. Various approaches that seek to attempt some or all of these limitations are reviewed in this work, including techniques that util...
متن کاملGranularity of Co-evolution Patterns in Dynamic Attributed Graphs
Many applications see huge demands for discovering relevant patterns in dynamic attributed graphs, for instance in the context of social interaction analysis. It is often possible to associate a hierarchy on the attributes related to graph vertices to explicit prior knowledge. For example, considering the study of scientific collaboration networks, conference venues and journals can be grouped ...
متن کاملTowards Mass Storage Systems with Object Granularity
Many applications, that need mass storage, manipulate data sets with KB – MB size objects. In contrast, mass storage devices work most efficiently for the storage and transfer of large files in the MB – GB range. Reflecting these device characteristics, mass storage systems typically have a file level granularity. To overcome the impedance mismatch between small objects and large files, we prop...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Review of Scientific Instruments
سال: 2015
ISSN: 0034-6748,1089-7623
DOI: 10.1063/1.4934543